A Binary Quantifier for Definite Descriptions for Cut Free Free Logics

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding

Bit-precise reasoning is important for many practical applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. From the theoretical point of view, only few results on the complexity of fixed-size bit-vector logics have been published. Most of these results only hold if unary encoding on the bit-wi...

Logics For Context { Free

We deene matchings, and show that they capture the essence of context{freeness. More precisely, we show that the class of context{ free languages coincides with the class of those sets of strings which can be deened by sentences of the form 9 b', where ' is rst order, b is a binary predicate symbol, and the range of the second order quantiier is restricted to the class of matchings. Several var...

Acquiring maximality in free relatives and definite descriptions

Craig Interpolation for Quantifier-Free Presburger Arithmetic

Craig interpolation has become a versatile algorithmic tool for improving software verification. Interpolants can, for instance, accelerate the convergence of fixpoint computations for infinite-state systems. They also help improve the refinement of iteratively computed lazy abstractions. Efficient interpolation procedures have been presented only for a few theories. In this paper, we introduce...

Quantifier-free logic for multialgebraic theories

We develop a new logic for deriving consequences of multialgebraic theories (specifications). Multilagebras are used as models for nondeterminism in the context of algebraic specifications. They are many sorted algebras with set valued operations. Atomic formulae are set inclusion t ≺ t′ – the interpretation of t is included in the interpretation of t′, and element equality t . = t′ – t and t′ ...